Abstracting Cryptographic Protocols with Tree Automata

A Method for Automatic Cryptographic Protocol Verification

We present an automatic, terminating method for verifying confidentiality properties, and to a lesser extent freshness properties of cryptographic protocols. It is based on a safe abstract interpretation of cryptographic protocols using a specific extension of tree automata, _-parameterized tree automata, which mix automata-theoretic techniques with deductive features. Contrary to most model-ch...

Tree automata with one memory set constraints and cryptographic protocols

Regular Protocols and Attacks with Regular Knowledge

We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic keys for a bounded number of sessions is NP-complete. We prove also that if regural languages (given by tree automata) are used in protocol descriptions to restrict the form of messages, then the insecurity problem is N...

ACTAS: Associative and Commutative Tree Automata Simulator

ACTAS is a tool set manipulating associative and commutative tree automata (AC-tree automata for short). The system is equipped with various functions for Boolean operations and rewrite descendant computation. This functionality allows to verify safety property in infinite state models, which is helpful in the domain of network security, in particular, for security problems of cryptographic pro...

INSTITUT FÜR INFORMATIK UND PRAKTISCHE MATHEMATIK Automata-based Analysis of Recursive Cryptographic Protocols

Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for instance, single rewrite rules—we call these protocols non-looping—and (2) protocols, such as group protocols, where the protocol steps are complex and typically involve an iterative or recursive computation— we call them r...